Integer Sparse Distributed Memory
نویسندگان
چکیده
Sparse distributed memory is an auto associative memory system that stores high dimensional Boolean vectors. Here we present an extension of the original SDM, the Integer SDM that uses modular arithmetic integer vectors rather than binary vectors. This extension preserves many of the desirable properties of the original SDM: auto associativity, content addressability, distributed storage, and robustness over noisy inputs. In addition, it improves the representation capabilities of the memory and is more robust over normali zation. It can also be extended to support forgetting and re liable sequence storage.
منابع مشابه
A Novel Parallel Algorithm for Gaussian Elimination of Sparse Unsymmetric Matrices
We describe a new algorithm for Gaussian Elimination suitable for general (unsymmetric and possibly singular) sparse matrices of any entry type, which has a natural parallel and distributed-memory formulation but degrades gracefully to sequential execution. We present a sample MPI implementation of a program computing the rank of a sparse integer matrix using the proposed algorithm. Some prelim...
متن کاملAn improved parallel block Lanczos algorithm over GF(2) for integer factorization
RSA is one of the most popular algorithms for public-key cryptosystems. The security of this algorithm relies on the difficulty of factoring large integers. GNFS is the most efficient algorithm for factoring large integers over 110 digits, and solving the large sparse linear system over GF(2) is one of the most time-consuming steps in the GNFS. In the thesis proposal, an improved and more effic...
متن کاملDMS: Distributed Sparse Tensor Factorization with Alternating Least Squares
Tensors are data structures indexed along three or more dimensions. Tensors have found increasing use in domains such as data mining and recommender systems where dimensions can have enormous length and are resultingly very sparse. The canonical polyadic decomposition (CPD) is a popular tensor factorization for discovering latent features and is most commonly found via the method of alternating...
متن کاملVector LIDA bica2014 submit
The representation paradigm used by a cognitive architecture helps to determine the kind of processes that it can perform more efficiently. Vector LIDA is a variation of the LIDA cognitive architecture that employs high-dimensional Modular Composite Representation (MCR) vectors as its main representation model and Integer Sparse Distributed Memory as its main memory implementation technology. T...
متن کاملAn Adaptive Sparse Distributed Memory
Sparse Distributed Memory is a content addressable, associative memory terhnique which relies on close memory items tending to be clustered together, with some abstraction and blurring of details. This paper discusses the limitations of the original model. Then, we propose a method which improve Sparse Distributed Memory efficiency through an adaptive threshold. The results obtained are good an...
متن کامل